Unstructured Peer-to-Peer Systems: Towards Swift Routing
نویسندگان
چکیده
منابع مشابه
Adaptive Routing Algorithms in Unstructured Peer-to-Peer (P2P) Systems
There are a variety of peer-to-peer (P2P) systems for sharing documents currently available. According to their data organization, P2P systems are classified into two categories: structured and unstructured P2P systems. In structured P2P systems, peers are organized according to some mapping techniques, e.g. hashing function. Whereas in unstructured P2P system, peers are connected to each other...
متن کاملPath Query Routing in Unstructured Peer-to-Peer Networks
In this article, we introduce a way to distribute an index database of XML documents on an unstructured peer-to-peer network with a flat topology (i.e. with no super-peer). We then show how to perform content path query routing in such networks. Nodes in the network maintain a set of Multi Level Bloom Filters that summarises structural properties of XML documents. They propagate part of this in...
متن کاملCyclic Routing in Peer-to-Peer Systems
Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance t...
متن کاملGreedy Routing in Peer-to-Peer Systems∗
We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of a random graph embedded in a metric space whose points represent resource identifiers, where the probability of a connection between two nodes depends only o...
متن کاملRouting Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i2.3.9963